Dynamic Backtracking with Constraint Propagation Application to numeric csps
نویسندگان
چکیده
Recent works on constraint relaxation [Jussien, 1997; Jussien and Boizumault, 1997b] provided the decorum system (Deduction-based Constraint Relaxation Management). That system can be seen as an integration of arc-consistency within the dynamic backtracking algorithm [Ginsberg, 1993]. Dynamic backtracking replaces the backtracking process by a much less blind behavior that consists in local modi cations of the choices made up to the current situation. In this paper, a new enumeration technique over numeric csps is proposed: dynamic domain splitting. This is a domain splitting search where chronological backtracking is replaced by a kind of dynamic backtracking.
منابع مشابه
Dynamic Domain Splitting for Numeric CSPs
In this paper, a new search technique over numeric csps is presented: dynamic domain splitting. The usual search technique over numeric csps is a dichotomic search interleaved with a consistency ltering, which is called domain splitting. This paper proposes to replace chronological backtracking at the core of domain splitting by a non destructive backtracking technique.
متن کاملNondeterrninistic Lis as a Substrate for Csnstrai rogram
We have implemented a comprehensive constraintbased programming language as an extension to COMMON LISP. This constraint package provides a unified framework for solving both numeric and non-numeric systems of constraints using a combination of local propagation techniques including binding propagation, Boolean constraint propagation, generalized forward checking, propagation of bounds, and uni...
متن کاملA Rule-based Approach to Dynamic Constraint Satisfaction Problems
Dynamic Constraint Satisfaction Problems Armin Wolf GMD { German National Research Center for Information Technology GMD FIRST, Kekul estra e 7, D-12489 Berlin, Germany E-mail: [email protected] URL: http://www.first.gmd.de Abstract Practical constraint satisfaction problems (CSPs) are rarely statically xed. For instance, in job-shopscheduling express jobs have to be added, while already plann...
متن کاملAccelerating filtering techniques for numeric CSPs
Search algorithms for solving Numeric CSPs (Constraint Satisfaction Problems) make an extensive use of filtering techniques. In this paper1 we show how those filtering techniques can be accelerated by discovering and exploiting some regularities during the filtering process. Two kinds of regularities are discussed, cyclic phenomena in the propagation queue and numeric regularities of the domain...
متن کاملChronological Backtracking Versus Formal Methods for Solving CSPs
The aim of this paper is to compare two techniques for solving constraint satisfaction problems(CSPs). The first one uses constraint propagation and chronological backtracking algorithm whereas the second one is based on LOTOS specifications. The language LOTOS combines a process calculus with abstract data types. The data part specifies the different constraints of a given CSP. The process par...
متن کامل